Advances in Distributed Branch and Bound
نویسندگان
چکیده
We describe a distributed version of an advanced branch and bound algorithm over graphical models. The crucial issue of load balancing is addressed by estimating subproblem complexity through learning, yielding impressive speedups on various hard problems using hundreds of parallel CPUs.
منابع مشابه
DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملInvestigating Whether the Gas Exporting Countries Forum (GECF) Can be Considered a Cartel: Application of Autoregressive Distributed Lag Bound Test and the Toda-Yamamoto Causality Test
The natural gas market is currently undergoing dramatic changes and is becoming globalized. One of the major developments in the global natural gas market in recent years is the establishment of the Gas Exporting Countries Forum (GECF). Since the founding of this forum, there have been many speculations about whether GECF would become a cartel like OPEC. Cartels contributes to the coordination ...
متن کاملPerformance of Parallel Branch and Bound Algorithms on the KSR1 Multiprocessor
In this paper we consider the parallelization of the branch and bound (BB) algorithm with best-rst search strategy on the KSR1 shared-memory mul-tiprocessor. Two shared-memory parallel BB algorithms are implemented on a 56-processor system. Measurements indicate that the scalability of the two algorithms is limited by the cost of interprocessor communications and by the cost of synchronization....
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملEfficient Implementation of Branch-and-Bound Method on Desktop Grids
The Berkeley Open Infrastructure for Network Computing (BOINC) is an opensource middleware system for volunteer and desktop grid computing. In this paper, we propose BNBTEST, a BOINC version of the distributed branch-andbound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012